Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f2(x, y) -> g2(x, y)
g2(h1(x), y) -> h1(f2(x, y))
g2(h1(x), y) -> h1(g2(x, y))

Q is empty.


QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f2(x, y) -> g2(x, y)
g2(h1(x), y) -> h1(f2(x, y))
g2(h1(x), y) -> h1(g2(x, y))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

G2(h1(x), y) -> G2(x, y)
F2(x, y) -> G2(x, y)
G2(h1(x), y) -> F2(x, y)

The TRS R consists of the following rules:

f2(x, y) -> g2(x, y)
g2(h1(x), y) -> h1(f2(x, y))
g2(h1(x), y) -> h1(g2(x, y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
QDP
      ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

G2(h1(x), y) -> G2(x, y)
F2(x, y) -> G2(x, y)
G2(h1(x), y) -> F2(x, y)

The TRS R consists of the following rules:

f2(x, y) -> g2(x, y)
g2(h1(x), y) -> h1(f2(x, y))
g2(h1(x), y) -> h1(g2(x, y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be strictly oriented and are deleted.


G2(h1(x), y) -> G2(x, y)
G2(h1(x), y) -> F2(x, y)
The remaining pairs can at least by weakly be oriented.

F2(x, y) -> G2(x, y)
Used ordering: Combined order from the following AFS and order.
G2(x1, x2)  =  G1(x1)
h1(x1)  =  h1(x1)
F2(x1, x2)  =  F1(x1)

Lexicographic Path Order [19].
Precedence:
[G1, F1]


The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ QDPOrderProof
QDP
          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

F2(x, y) -> G2(x, y)

The TRS R consists of the following rules:

f2(x, y) -> g2(x, y)
g2(h1(x), y) -> h1(f2(x, y))
g2(h1(x), y) -> h1(g2(x, y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 0 SCCs with 1 less node.